High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
نویسندگان
چکیده
We provide the first analytical expressions for expected waiting time of high-priority customers in delayed APQ by exploiting a classical conservation law work-conserving queues. Additionally, we describe an algorithm to compute times both low-priority and customers, which requires only truncation sums that converge quickly our experiments. These insights are used demonstrate how accumulation rate delay level should be chosen health care practitioners optimize common key performance indicators (KPIs). In particular, certain nontrivial KPIs, accumulating priority queue with zero is always preferable. Finally, present detailed investigation quality exponential approximation distribution, use choice queueing parameters respect classes’ distributions.
منابع مشابه
Waiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling
This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differenti...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملStrategic Bidding in an Accumulating Priority Queue: Equilibrium Analysis
We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/1 queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing (possibly heterogeneous) waiting costs in exchange. The priority of each customer in the queue is a linear function of the individual waiting time, with the purchased coefficient bei...
متن کاملPriority queue classes with priority update
A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...
متن کاملTail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
We consider the problem of estimating tail probabilities of waiting times in statistical multiplexing systems with two classes of sources { one with high priority and the other with low priority. The priority discipline is assumed to be nonpreemptive. Exact expressions for the transforms of these quantities are derived assuming that packet or cell streams are generated by Markovian Arrival Proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Infor
سال: 2022
ISSN: ['1619-0615', '0315-5986', '1916-0615']
DOI: https://doi.org/10.1080/03155986.2022.2038962